Shared Paged Binding Array: A Universal Datastructure for Parallel Logic Programming

نویسندگان

  • Gopal Gupta
  • Vítor Santos Costa
  • Enrico Pontelli
چکیده

Two major problems that arise in parallel logic programming systems are: (i) redundant computation during and-parallel execution of dependent goals, and, (ii) eecient representation of multiple environments at runtime. Both these problems are caused by non-determinism present in logic programs|responsible for much of the power of logic programming. This paper is mainly concerned with solving the second problem, namely, the eecient representation of multiple environments at runtime in parallel logic programming systems. We present a datastructure called the Shared Paged Binding Array that arguably is most suited for implementing any arbitrary parallel logic programming system (i.e., a system that exploits any arbitrary combination of dependent-and parallelism, independent and-parallelism and or-parallelism). This datastructure can also be used for and-or parallel execution of Committed Choice Languages with Deep Guards as well as for realizing the implementations of more advanced models of parallel execution such as the Extended Andorra Model and the Andorra Kernel Language. Details of the Shared Paged Binding Array are presented, its merits over other techniques are shown, and, nally, implementations that combine different avors of and-and or-parallelism using Shared Paged Binding Arrays are brieey sketched.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Systematic Approach to Exploiting Implicit Parallelism in Full Prolog

Prolog is a practical declarative programming language based on Horn Logic. In this paper we argue that implicit parallelism can be extracted from full Prolog. By full Prolog we mean pure Prolog with extra-logical features such as side-eeects, database predicates and cuts. Prolog programs have three main forms of implicit parallelism present in them: or-parallelism, independent and-parallelism ...

متن کامل

Novel Models for Or-Parallel Logic Programs: A Performance Analysis

One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel systems, such as Aurora and Muse, have been the most successful parallel logic programming systems so far. Or-parallel systems rely on techniques such as Environment Copying to address the problem that branches being explor...

متن کامل

And-Or Parallelism on Shared-Memory Multiprocessorsy

This paper presents an extended and-or tree and an extended WAM (Warren Abstract Machine) for eeciently supporting both and-parallel and or-parallel execution of logic programs on shared-memory multiprocessors. Our approach for exploiting both and-and or-parallelism is based on the binding-arrays method for or-parallelism and the RAP (Restricted And-Parallelism) method for and-parallelism, two ...

متن کامل

And-Or Parallelism on Shared-Memory Multiprocessors

D This paper presents an extended and-or tree and an extended WAM (Warren Abstract Machine) for efficiently supporting both and-parallel and or-parallel execution of logic programs on shared-memory multiprocessors. Our approach for exploiting both andand or-parallelism is based on the binding-arrays method for or-parallelism and the RAP (Restricted And-Parallelism) method for and-parallelism, t...

متن کامل

Paged Binding Array: Environment Representation for And-Or Parallel Prolog

We show that to exploit both Independent And-and Or-parallelism from Prolog programs independent goals should be recomputed (vs their solutions reused). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in Prolog Programs. The Composition-tree closely mirrors sequential Prolog execution (by recomputing independent goal rather than re-using them). We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995